LINEAR AND NONLINEAR SEMIDEFINITE PROGRAMMING
نویسندگان
چکیده
منابع مشابه
A Recurrent Neural Network Model for Solving Linear Semidefinite Programming
In this paper we solve a wide rang of Semidefinite Programming (SDP) Problem by using Recurrent Neural Networks (RNNs). SDP is an important numerical tool for analysis and synthesis in systems and control theory. First we reformulate the problem to a linear programming problem, second we reformulate it to a first order system of ordinary differential equations. Then a recurrent neural network...
متن کاملEfficient First-order Methods for Linear Programming and Semidefinite Programming
The study of first-order methods has largely dominated research in continuous optimization for the last decade, yet still the range of problems for which “optimal” first-order methods have been developed is surprisingly limited, even though much has been achieved in some areas with high profile, such as compressed sensing. Even if one restricts attention to, say, linear programming, the problem...
متن کاملNumerical Stability in Linear Programming and Semidefinite Programming
We study numerical stability for interior-point methods applied to Linear Programming, LP, and Semidefinite Programming, SDP. We analyze the difficulties inherent in current methods and present robust algorithms. We start with the error bound analysis of the search directions for the normal equation approach for LP. Our error analysis explains the surprising fact that the ill-conditioning is no...
متن کاملA filter algorithm for nonlinear semidefinite programming
This paper proposes a filter method for solving nonlinear semidefinite programming problems. Our method extends to this setting the filter SQP (sequential quadratic programming) algorithm, recently introduced for solving nonlinear programming problems, obtaining the respective global convergence results. Mathematical subject classification: 90C30, 90C55.
متن کاملLocal Duality of Nonlinear Semidefinite Programming
In a recent paper [8], Chan and Sun reported for semidefinite programming (SDP) that the primal/dual constraint nondegeneracy is equivalent to the dual/primal strong second order sufficient condition (SSOSC). This result is responsible for a number of important results in stability analysis of SDP. In this paper, we study duality of this type in nonlinear semidefinite programming (NSDP). We int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pesquisa Operacional
سال: 2014
ISSN: 0101-7438
DOI: 10.1590/0101-7438.2014.034.03.0495